G-Frame and Riesz Sequences in Hilbert Spaces

G-frames generalize frames in Hilbert spaces. The literatures show that g-frames and frames share many similar properties, while they behave differently in redundancy and perturbation properties. Interestingly, g-frames have been extensively studied, but g-frame sequences have not. This problem is nontrivial since a g-frame and a frame both involve all vectors in the same Hilbert space, while a g-frame sequence and a frame sequence do not. They involve different linear spans. Using the synthesis and Gram matrix methods, we in this paper characterize g-frame sequences and g-Riesz sequences; obtain the Pythagorean theorem for g-orthonormal systems. These results recover several known results and lead to some new results on g-frames.     

非Hermitian正定线性方程组的外推的HSS迭代方法

为了高效地求解大型稀疏非Hermitian正定线性方程组，在白中治、Golub和Ng提出的Hermitian和反Hermitian分裂（HSS）迭代法的基础上，通过引入新的参数并结合迭代法的松弛技术，对HSS迭代方法进行加速，提出了一种新的外推的HSS迭代方法（EHSS），并研究了该方法的收敛性.数值例子表明：通过参数值的选择，新方法比HSS方法具有更快的收敛速度和更少的迭代次数，选择了合适的参数值后，可以提高HSS方法的收敛效率.     

The maximum number of columns in supersaturated designs with

Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle .     

Characterizations of ( m,n )-Jordan Derivations and ( m,n )-Jordan Derivable Mappings on Some Algebras

Let R be a ring, M be a R-bimodule and m, n be two fixed nonnegative integers with m + n = 0. An additive mapping δ from R into M is called an(m, n)-Jordan derivation if(m +n)δ(A~2) = 2 mAδ(A) + 2nδ(A)A for every A in R. In this paper, we prove that every(m, n)-Jordan derivation with m = n from a C*-algebra into its Banach bimodule is zero. An additive mappingδ from R into M is called a(m, n)-Jordan derivable mapping at W in R if(m + n)δ(AB + BA) =2mδ(A)B + 2 mδ(B)A + 2 nAδ(B) + 2 nBδ(A) for each A and B in R with AB = BA = W. We prove that if M is a unital A-bimodule with a left(right) separating set generated algebraically by all idempotents in A, then every(m, n)-Jordan derivable mapping at zero from A into M is identical with zero. We also show that if A and B are two unital algebras, M is a faithful unital(A, B)-bimodule and U = [A M N B] is a generalized matrix algebra, then every(m, n)-Jordan derivable mapping at zero from U into itself is equal to zero.     

Birnbaum‐Saunders distribution: A review of models,analysis, and applications

Birnbaum and Saunders introduced a two‐parameter lifetime distribution to model the fatigue life of a metal, subject to cyclic stress. Since then, extensive work has been done on this model providing different interpretations, constructions, generalizations, inferential methods, and extensions to bivariate, multivariate, and matrix‐variate cases. More than 200 papers and one research monograph have already appeared describing all these aspects and developments. In this paper, we provide a detailed review of all these developments and, at the same time, indicate several open problems that could be considered for further research.     

求解矩阵方程AXB+CXD=F参数迭代法的最优参数分析

本文针对求矩阵方程AXB+CXD=F唯一解的参数迭代法，分析当矩阵A，B，C，D均是Hermite正（负）定矩阵时，迭代矩阵的特征值表达式，给出了最优参数的确定方法，并提出了相应的加速算法.